Cubic graphs with most automorphisms
نویسندگان
چکیده
Let G be a connected simple cubic graph; Aut G denotes its automorphism group. Let n be half the number of vertices of G. We define the arithmetic genus of a (possibly disconnected) graph as e−v+1 where e is the number of edges, v the number of vertices of G). For a connected simple cubic graph, g = n+1. The definition of arithmetic genus is motivated by the following: to a projective nodal curve with rational components one may associate a socalled dual graph; the arithmetic genus of the curve is the arithmetic genus of this graph. We abbreviate arithmetic genus to “genus” everywhere in this article, although this is at variance with standard graph theory terminology. We trust that this will not actually be confusing. A bound on the order of Aut G was obtained in [6], where it is shown that |Aut G| divides 3n · 2n. However, it can be easily checked by consulting a list of cubic graphs1, that this bound is only rarely attained (in fact, it is only attained for graphs with four or six vertices). Thus a natural problem is to find a sharp bound for the order of Aut G. We solve this problem by the following:
منابع مشابه
Semiregular Automorphisms of Cubic Vertex-transitive Graphs
We characterise connected cubic graphs admitting a vertextransitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a semiregular subgroup of maximum order in a vertex-transitive group of automorphisms of a connected cubic graph grows with the order of the graph, settling [2, Problem ...
متن کاملSemiregular Automorphisms of Cubic Vertex-Transitive Graphs and the Abelian Normal Quotient Method
We characterise connected cubic graphs admitting a vertex-transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a semiregular subgroup of maximum order in a vertex-transitive group of automorphisms of a connected cubic graph grows with the order of the graph. ∗This work was suppo...
متن کاملOn Cubic Graphs Admitting an Edge-Transitive Solvable Group
Using covering graph techniques, a structural result about connected cubic simple graphs admitting an edge-transitive solvable group of automorphisms is proved. This implies, among other, that every such graph can be obtained from either the 3-dipole Dip3 or the complete graph K4, by a sequence of elementary-abelian covers. Another consequence of the main structural result is that the action of...
متن کاملCubic Non-Cayley Vertex-Transitive Bi-Cayley Graphs over a Regular $p$-Group
A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits of equal size. In this paper, we give a characterization of cubic nonCayley vertex-transitive bi-Cayley graphs over a regular p-group, where p > 5 is a prime. As an application, a classification of cubic non-Cayley vertex-transitive graphs of order 2p3 is given for each prime p.
متن کاملEdge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms
متن کامل
An infinite family of biquasiprimitive 2-arc transitive cubic graphs
A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the stabiliser of the biparts is not quasiprimitive on either bipart.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 64 شماره
صفحات -
تاریخ انتشار 2010